MoHiD: A Scalable Mobility Platform based on Hierarchical Distributed Hash Table

نویسندگان

  • Haeun Kim
  • Jaehyun Park
  • Sangyup Han
چکیده

In order to resolve the scalability and handover performance issues of existing approaches, we propose a scalable mobility platform which is based on the hierarchical Distributed Hash Table (HDHT), referred to here as MoHiD, to provide host mobility through a DHT. In MoHiD, the location information of the hosts is stored in the HDHT running on the MoHiD Access Router to provide mobility. In the HDHT, the storage level of each entry can be specified, which drastically reduces the handover delay by limiting the number of overlay hops occurring during the query processing steps. In order to demonstrate the feasibility of MoHiD, we used a commercial cloud to measure the entry query time of the HDHT on the global scale and constructed a testbed to measure the handover performance. The experimental results show that the HDHT query delay and the total handover delay are 16.7 ms and 115.9 ms, respectively, this providing evidence of rapid handovers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical DHT and proportional replication based mobility management for large-scale mobile Internet

A considerable amount of research on distributed hash table (DHT) basedmobility support schemes, which are highly user scalable and load balanced, has been done. But these schemes have shortcomings in query performances and network scalability. It is because although routing of overlay is effective, there is inconsistency between logical and physical topologies, so the actual physical network p...

متن کامل

A DHT-inspired clean-slate approach for the Next Generation Internet

The Internet architecture of today is the result of a constant evolution during the past 25 years. However, this layering of add-ons, bug fixes and extensions has grown into a tremendously complex and therefore increasingly static platform. On the contrary, a multitude of new challenges related to issues never conceived in the original design, such as security and mobility have grown more and m...

متن کامل

A Scalable Peer-to-Peer Lookup Model

One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms , this paper presents a hierarchical and manageable resource locating model (HMRLM)which can provide P2P networks with scalability and manageability.

متن کامل

Hierarchical Structured Peer-to-Peer Networks

Structured peer-to-peer systems or distributed hash tables (DHT) are self-organizing distributed systems designed to support efficient and scalable lookups with dynamic network topology changes. Nodes are organized as structured overlay networks, and data is mapped to nodes in the overlap network based on their identifier. There are two main types of structured peer-to-peer architectures: flat ...

متن کامل

Distributed Document Sharing with Text Classification over Content-Addressable Network

Content-addressable network is a scalable and robust distributed hash table providing distributed applications to store and retrieve information in an efficient manner. We consider design and implementation issues of a document sharing system over a content-addressable overlay network. Improvements and their applicability on a document sharing system are discussed. We describe our system protot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017